On the Game Domination Number of Graphs with Given Minimum Degree

In the domination game, introduced by Brešar, Klavžar, and Rall in 2010, Dominator and Staller alternately select a vertex of a graph G. A move is legal if the selected vertex v dominates at least one new vertex – that is, if we have a u ∈ N [v] for which no vertex from N [u] was chosen up to this point of the game. The game ends when no more legal moves can be made, and its length equals the number of vertices selected. The goal of Dominator is to minimize whilst that of Staller is to maximize the length of the game. The game domination number γg(G) of G is the length of the domination game in which Dominator starts and both players play optimally. In this paper we establish an upper bound on γg(G) in terms of the minimum degree δ and the order n of G. Our main result states that for every δ > 4, γg(G) 6 15δ4 − 28δ3 − 129δ2 + 354δ − 216 45δ4 − 195δ3 + 174δ2 + 174δ − 216 n. Particularly, γg(G) < 0.5139 n holds for every graph of minimum degree 4, and γg(G) < 0.4803 n if the minimum degree is greater than 4. Additionally, we prove that γg(G) < 0.5574 n if δ = 3.